package leetcode.problems;

/**
 * Created by Administrator on 2018/3/16.
 */
public class _0316test {
   /* 783. Minimum Distance Between BST Nodes
    User Accepted: 1289
    User Tried: 1432
    Total Accepted: 1317
    Total Submissions: 2841
    Difficulty: Easy
    Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree.

    Example :

    Input: root = [4,2,6,1,3,null,null]
    Output: 1
    Explanation:
    Note that root is a TreeNode object, not an array.

    The given tree [4,2,6,1,3,null,null] is represented by the following diagram:

        4
        /   \
        2      6
        / \
        1   3

        while the minimum difference in this tree is 1, it occurs between node 1 and node 2, also between node 3 and node 2.
    Note:

    The size of the BST will be between 2 and 100.
    The BST is always valid, each node's value is an integer, and each node's value is different.*/




    public static void main(String[] args) {
        int i = get(5);
        System.out.println(i );
    }

    private static int getsum(int i) {

        return 0;
    }

    private static int get(int i) {
        int j =0;
        if(i >= 2){
            return 1;
        }else{
            return get(i-1) +j;
        }
    }

}
